0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.34 % Computer : n031.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 11:37:29 EDT 2021 0.13/0.34 % CPUTime : 0.13/0.35 % Number of cores: 8 0.13/0.35 % Python version: Python 3.6.8 0.13/0.35 # Version: 2.6rc1-ho 0.13/0.35 # No SInE strategy applied 0.13/0.35 # Trying AutoSched0 for 59 seconds 0.13/0.38 # AutoSched0-Mode selected heuristic G_E___208_C48_F1_AE_CS_SP_PS_S0Y 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred. 0.13/0.38 # 0.13/0.38 # Preprocessing time : 0.028 s 0.13/0.38 # Presaturation interreduction done 0.13/0.38 0.13/0.38 # Proof found! 0.13/0.38 # SZS status Theorem 0.13/0.38 # SZS output start CNFRefutation 0.13/0.38 thf(cTHM533, conjecture, (![X1:(a > $o) > $o]:(?[X2:(a > $o) > a]:![X3:a > $o]:(X1 @ X3=>X3 @ (X2 @ X3))<=![X3:a > $o]:(?[X4:a]:X3 @ X4<=X1 @ X3))<=![X5:(a > $o) > a > $o]:?[X6:(a > $o) > a]:![X7:a > $o]:(?[X8:a]:X5 @ X7 @ X8=>X5 @ X7 @ (X6 @ X7))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM533)). 0.13/0.38 thf(c_0_1, negated_conjecture, ~((![X5:(a > $o) > a > $o]:?[X6:(a > $o) > a]:![X7:a > $o]:(?[X8:a]:X5 @ X7 @ X8=>X5 @ X7 @ (X6 @ X7))=>![X1:(a > $o) > $o]:(![X3:a > $o]:(X1 @ X3=>?[X4:a]:X3 @ X4)=>?[X2:(a > $o) > a]:![X3:a > $o]:(X1 @ X3=>X3 @ (X2 @ X3))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM533])])). 0.13/0.38 thf(c_0_2, negated_conjecture, ![X18:(a > $o) > a > $o, X20:a > $o, X21:a, X23:a > $o, X25:(a > $o) > a]:((~X18 @ X20 @ X21|X18 @ X20 @ (esk1_1 @ X18 @ X20))&((~epred1_0 @ X23|X23 @ (esk2_1 @ X23))&(epred1_0 @ (epred2_1 @ X25)&~epred2_1 @ X25 @ (X25 @ (epred2_1 @ X25))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.13/0.38 thf(c_0_3, negated_conjecture, ![X2:(a > $o) > a]:~epred2_1 @ X2 @ (X2 @ (epred2_1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.38 thf(c_0_4, negated_conjecture, ![X3:a > $o]:(X3 @ (esk2_1 @ X3)|~epred1_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.38 thf(c_0_5, negated_conjecture, ![X2:(a > $o) > a]:epred1_0 @ (epred2_1 @ X2), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.38 thf(c_0_6, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_4]), c_0_5])]), ['proof']). 0.13/0.38 # SZS output end CNFRefutation 0.13/0.38 # Proof object total steps : 7 0.13/0.38 # Proof object clause steps : 4 0.13/0.38 # Proof object formula steps : 3 0.13/0.38 # Proof object conjectures : 7 0.13/0.38 # Proof object clause conjectures : 4 0.13/0.38 # Proof object formula conjectures : 3 0.13/0.38 # Proof object initial clauses used : 3 0.13/0.38 # Proof object initial formulas used : 1 0.13/0.38 # Proof object generating inferences : 1 0.13/0.38 # Proof object simplifying inferences : 2 0.13/0.38 # Training examples: 0 positive, 0 negative 0.13/0.38 # Parsed axioms : 2 0.13/0.38 # Removed by relevancy pruning/SinE : 0 0.13/0.38 # Initial clauses : 5 0.13/0.38 # Removed in clause preprocessing : 1 0.13/0.38 # Initial clauses in saturation : 4 0.13/0.38 # Processed clauses : 7 0.13/0.38 # ...of these trivial : 0 0.13/0.38 # ...subsumed : 0 0.13/0.38 # ...remaining for further processing : 7 0.13/0.38 # Other redundant clauses eliminated : 0 0.13/0.38 # Clauses deleted for lack of memory : 0 0.13/0.38 # Backward-subsumed : 0 0.13/0.38 # Backward-rewritten : 0 0.13/0.38 # Generated clauses : 3 0.13/0.38 # ...of the previous two non-trivial : 0 0.13/0.38 # Contextual simplify-reflections : 0 0.13/0.38 # Paramodulations : 1 0.13/0.38 # Factorizations : 0 0.13/0.38 # NegExts : 0 0.13/0.38 # Equation resolutions : 0 0.13/0.38 # Propositional unsat checks : 0 0.13/0.38 # Propositional check models : 0 0.13/0.38 # Propositional check unsatisfiable : 0 0.13/0.38 # Propositional clauses : 0 0.13/0.38 # Propositional clauses after purity: 0 0.13/0.38 # Propositional unsat core size : 0 0.13/0.38 # Propositional preprocessing time : 0.000 0.13/0.38 # Propositional encoding time : 0.000 0.13/0.38 # Propositional solver time : 0.000 0.13/0.38 # Success case prop preproc time : 0.000 0.13/0.38 # Success case prop encoding time : 0.000 0.13/0.38 # Success case prop solver time : 0.000 0.13/0.38 # Current number of processed clauses : 3 0.13/0.38 # Positive orientable unit clauses : 1 0.13/0.38 # Positive unorientable unit clauses: 0 0.13/0.38 # Negative unit clauses : 1 0.13/0.38 # Non-unit-clauses : 1 0.13/0.38 # Current number of unprocessed clauses: 1 0.13/0.38 # ...number of literals in the above : 2 0.13/0.38 # Current number of archived formulas : 0 0.13/0.38 # Current number of archived clauses : 4 0.13/0.38 # Clause-clause subsumption calls (NU) : 0 0.13/0.38 # Rec. Clause-clause subsumption calls : 0 0.13/0.38 # Non-unit clause-clause subsumptions : 0 0.13/0.38 # Unit Clause-clause subsumption calls : 0 0.13/0.38 # Rewrite failures with RHS unbound : 0 0.13/0.38 # BW rewrite match attempts : 0 0.13/0.38 # BW rewrite match successes : 0 0.13/0.38 # Condensation attempts : 0 0.13/0.38 # Condensation successes : 0 0.13/0.38 # Termbank termtop insertions : 451 0.13/0.38 0.13/0.38 # ------------------------------------------------- 0.13/0.38 # User time : 0.029 s 0.13/0.38 # System time : 0.002 s 0.13/0.38 # Total time : 0.031 s 0.13/0.38 # Maximum resident set size: 1652 pages 0.13/0.38 EOF